DNA-based computing of strategic assignment problems.
نویسندگان
چکیده
DNA-based computing is a novel technique to tackle computationally difficult problems, in which computing time grows exponentially corresponding to problematic size. A strategic assignment problem is a typical nondeterministic polynomial problem, which is often associated with strategy applications. In this Letter, a new approach dealing with strategic assignment problems is proposed based on manipulating DNA strands, which is believed to be better than the conventional silicon-based computing in solving the same problem.
منابع مشابه
Parallelizing Assignment Problem with DNA Strands
Background:Many problems of combinatorial optimization, which are solvable only in exponential time, are known to be Non-Deterministic Polynomial hard (NP-hard). With the advent of parallel machines, new opportunities have been emerged to develop the effective solutions for NP-hard problems. However, solving these problems in polynomial time needs massive parallel machines and ...
متن کاملStrategic planning trips within the city emphasize goals over travel using traffic assignment model topsis and GIS (Case study: Kerman)
Strategic management, program coordinator, which is comprehensive and continuous link with the environment and your organization's top talent, the goal of the organization is managed in a proper implementation. Tuday One of the most important challenges facing large cities is transportation within the city. Lack of strategic planning for urban transport systems also joint ventures that replica...
متن کاملHybrid Meta-heuristic Algorithm for Task Assignment Problem
Task assignment problem (TAP) involves assigning a number of tasks to a number of processors in distributed computing systems and its objective is to minimize the sum of the total execution and communication costs, subject to all of the resource constraints. TAP is a combinatorial optimization problem and NP-complete. This paper proposes a hybrid meta-heuristic algorithm for solving TAP in a ...
متن کاملA novel approach in robust group decision making for supply strategic planning
Long-term planning is a challenging process for dealing with problems in big industries. Quick and flexible process of responding to the existing variable requirements are considered in such problems. Some of important strategic decisions which should be made in this field are, namely the way that manufacturing facilities should be applied as well as assignment and design the system of delivery...
متن کاملSIZE AND GEOMETRY OPTIMIZATION OF TRUSS STRUCTURES USING THE COMBINATION OF DNA COMPUTING ALGORITHM AND GENERALIZED CONVEX APPROXIMATION METHOD
In recent years, the optimization of truss structures has been considered due to their several applications and their simple structure and rapid analysis. DNA computing algorithm is a non-gradient-based method derived from numerical modeling of DNA-based computing performance by new computers with DNA memory known as molecular computers. DNA computing algorithm works based on collective intelli...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Physical review letters
دوره 106 18 شماره
صفحات -
تاریخ انتشار 2011